Intrinsically gs;0alpha; relations

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Intrinsically Polar Elastic Metamaterials.

In many applications, one needs to combine materials with varying properties to achieve certain functionalities. For example, the inner layer of a helmet should be soft for cushioning while the outer shell should be rigid to provide protection. Over time, these combined materials either separate or wear and tear, risking the exposure of an undesired material property. This work presents a desig...

متن کامل

Intrinsically Universal Cellular Automata

This talk advocates intrinsic universality as a notion to identify simple cellular automata with complex computational behavior. After an historical introduction and proper definitions of intrinsic universality, which is discussed with respect to Turing and circuit universality, we discuss construction methods for small intrinsically universal cellular automata before discussing techniques for ...

متن کامل

Intrinsically Motivated Machines

Intrinsic motivation is what causes us to do something “for its own sake,” in contrast to doing something for an external reward. There is great interest in building intrinsic motivation into artificial systems by defining intrinsic reward signals within the reinforcement learning framework. Yet, what intrinsic reward signals are, and how it may differ from extrinsic reward signals, remains a m...

متن کامل

More intrinsically knotted graphs

We demonstrate four intrinsically knotted graphs that do not contain each other, nor any previously known intrinsically knotted graph, as a minor.

متن کامل

Intrinsically defined sorting functions

We exhibit intrinsic definitions of inequality tests, sorting functions and comparators as isomorphic presentations of total preorders (orders): • Inequality tests are functions of type T × T → Bool that are reflexive, transitive and total. • Sorting functions are functions of type T ∗ → T ∗ (mapping finite sequences of elements of type T ) that permute their input and do so consistently for ea...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Pure and Applied Logic

سال: 1988

ISSN: 0168-0072

DOI: 10.1016/0168-0072(88)90014-0